1866B - Battling with Numbers - CodeForces Solution

#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS

#include <iterator>
#include <iostream>
#include <iomanip>
#include <vector>
#include <numeric>
#include <algorithm>
#include <string>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <fstream>

using namespace std;

#define ll long long
#define ld long double
#define forn(i, n) for (long long i = 0; i < n; i++)
#define whole(a) a.begin(), a.end()
#define min(a, b) (a < b ? a : b)
#define max(a, b) (a > b ? a : b)


long long mod = 998244353;

long long mult(long long a, long long b)
{
	return (((a % mod + mod) % mod) * ((b % mod + mod) % mod)) % mod;
}
long long sum(long long a, long long b)
{
	return (a + b + 3 * mod) % mod;
}
long long binpow(long long x, long long n)
{
	if (n == 0) return 1;
	if (n & 1) return mult(x, binpow(x, n - 1)) % mod;

	long long t = binpow(x, n / 2) % mod;
	return mult(t, t);
}
long long divide(long long a, long long b)
{
	return a * binpow(b, mod - 2) % mod;
}

void solve()
{
	ll n;
	cin >> n;
	vector<ll> a1(n), a2(n);
	forn(i, n)
		cin >> a1[i];
	forn(i, n)
		cin >> a2[i];

	ll m;
	cin >> m;
	vector<ll> b1(m), b2(m);
	forn(i, m)
		cin >> b1[i];
	forn(i, m)
		cin >> b2[i];

	ll k = 0;
	ll cnt = n;
	forn(i, m)
	{
		while (k < n && a1[k] != b1[i]) k++;
		if (k == n)
		{
			cout << 0;
			return;
		}

		if (a2[k] == b2[i])
			cnt--;
		else if (a2[k] < b2[i])
		{
			cout << 0;
			return;
		}

	}
	cout << binpow(2, cnt) << endl;
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);


	long long t = 1;
	//cin >> t;
	while (t--)
		solve();

	return 0;
}